Concept Learning and Heuristic Classiication in Weak-theory Domains 1

نویسندگان

  • Bruce W. Porter
  • Robert C. Holte
چکیده

This paper describes a successful approach to concept learning for heuristic classi cation. Almost all current programs for this task create or use explicit, abstract generalizations. These programs are largely ine ective for domains with weak or intractable theories. An exemplar-based approach is suitable for domains with inadequate theories but raises two additional problems: determining similarity and indexing exemplars. Our approach extends the exemplar-based approach with solutions to these problems. An implementation of our approach, called Protos, has been applied to the domain of clinical audiology. After reasonable training, Protos achieved a competence level equaling that of human experts and far surpassing that of other machine learning programs. Additionally, an \ablation study" has identi ed the aspects of Protos that are primarily responsible for its success.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Supervised versus Unsupervised Binary - Learningby Feedforward Neural

Binary classiication is typically achieved by supervised learning methods. Nevertheless , it is also possible using unsupervised schemes. This paper describes a connectionist unsupervised approach to binary classiication and compares its performance to that of its supervised counterpart. The approach consists of training an autoassociator to reconstruct the positive class of a domain at the out...

متن کامل

Restricting the Hypothesis Space, Guiding the Search, and Handling the Redundant Information in Inductive Logic Programming

ii Abstract We developed and implemented an inductive logic programming system and the rst order classiier, called ILP-R. It is capable of eeciently inducing theories in a restricted subset of function free normal programs. It is able to use the hypothesis to classify new instances, by using the naive Bayesian reasoning. The contributions of the system are threefold. First, we devised a weak sy...

متن کامل

Concept Learning and Heuristic Classification in WeakTtheory Domains

This paper describes a successful approach to concept learning for heuristic classi cation. Almost all current programs for this task create or use explicit, abstract generalizations. These programs are largely ine ective for domains with weak or intractable theories. An exemplar-based approach is suitable for domains with inadequate theories but raises two additional problems: determining simi...

متن کامل

What Are Neuro{fuzzy Classiiers?

Neuro{fuzzy combination are considered for several years already. However, the term \neuro{fuzzy" still lacks of proper deenition, and it has the avor of a \buzz word". In this paper we try to give it a meaning in the context of fuzzy classiication systems. From our point of view \neuro{fuzzy" means the employment of heuristic learning strategies derived from the domain of neural network theory...

متن کامل

On Weak Base Learners for Boosting Regression and Classiication on Weak Base Learners for Boosting Regression and Classiication

The most basic property of the boosting algorithm is its ability to reduce the training error, subject to the critical assumption that the base learners generate weak hypotheses that are better that random guessing. We exploit analogies between regression and classiication to give a characterization on what base learners generate weak hypotheses, by introducing a geometric concept called the an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006